# Euler pseudoprime to the base b

﻿
Euler pseudoprime to the base b
псевдопростое число Эйлера по основанию b

English-Russian cryptological dictionary . 2014.

### Смотреть что такое "Euler pseudoprime to the base b" в других словарях:

• Euler pseudoprime — An odd composite integer n is called an Euler pseudoprime to base a , if a and n are coprime, and : a^{(n 1)/2} equiv pm 1pmod{n}(where mod refers to the modulo operation).The motivation for this definition is the fact that all prime numbers p… …   Wikipedia

• Pseudoprime — A pseudoprime is a probable prime (an integer which shares a property common to all prime numbers) which is not actually prime. Pseudoprimes can be classified according to which property they satisfy.The most important class of pseudoprimes come… …   Wikipedia

• Euler-Jacobi pseudoprime — In number theory, an odd composite integer n is called an Euler Jacobi pseudoprime to base a , if a and n are coprime, and : a ( n − 1)/2 = ( a / n ) (mod n ), where ( a / n ) is the Jacobi symbol.The motivation for this definition is the fact… …   Wikipedia

• Strong pseudoprime — In number theory, a strong pseudoprime is a composite number that passes a pseudoprimality test. All primes pass this test, but a small fraction of composites pass as well, making them false primes . Unlike the Fermat pseudoprimes, for which… …   Wikipedia

• List of topics named after Leonhard Euler — In mathematics and physics, there are a large number of topics named in honour of Leonhard Euler (pronounced Oiler ). As well, many of these topics include their own unique function, equation, formula, identity, number (single or sequence), or… …   Wikipedia

• Probable prime — In number theory, a probable prime (PRP) is an integer that satisfies a specific condition also satisfied by all prime numbers. Different types of probable primes have different specific conditions. While there may be probable primes that are… …   Wikipedia

• Fermat number — In mathematics, a Fermat number, named after Pierre de Fermat who first studied them, is a positive integer of the form:F {n} = 2^{2^{ overset{n} {} + 1where n is a nonnegative integer. The first nine Fermat numbers are OEIS|id=A000215:As of|2008 …   Wikipedia

• Mersenne prime — Named after Marin Mersenne Publication year 1536 Author of publication Regius, H. Number of known terms 47 Conjectured number of terms Infinite …   Wikipedia

• 1729 (number) — This article is about the number. For the year, see 1729. List of numbers Integers ← 1k 2k 3k 4k 5k 6k 7k 8k 9k → 1729 Cardinal …   Wikipedia

• Miller–Rabin primality test — The Miller–Rabin primality test or Rabin–Miller primality test is a primality test: an algorithm which determines whether a given number is prime, similar to the Fermat primality test and the Solovay–Strassen primality test. Its original version …   Wikipedia

• Fermat's little theorem — (not to be confused with Fermat s last theorem) states that if p is a prime number, then for any integer a , a^p a will be evenly divisible by p . This can be expressed in the notation of modular arithmetic as follows::a^p equiv a pmod{p},!A… …   Wikipedia

### Поделиться ссылкой на выделенное

##### Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»

We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.